home *** CD-ROM | disk | FTP | other *** search
- package java.nio;
-
- public abstract class IntBuffer extends Buffer implements Comparable<IntBuffer> {
- // $FF: renamed from: hb int[]
- final int[] field_0;
- final int offset;
- boolean isReadOnly;
-
- IntBuffer(int var1, int var2, int var3, int var4, int[] var5, int var6) {
- super(var1, var2, var3, var4);
- this.field_0 = var5;
- this.offset = var6;
- }
-
- IntBuffer(int var1, int var2, int var3, int var4) {
- this(var1, var2, var3, var4, (int[])null, 0);
- }
-
- public static IntBuffer allocate(int var0) {
- if (var0 < 0) {
- throw new IllegalArgumentException();
- } else {
- return new HeapIntBuffer(var0, var0);
- }
- }
-
- public static IntBuffer wrap(int[] var0, int var1, int var2) {
- try {
- return new HeapIntBuffer(var0, var1, var2);
- } catch (IllegalArgumentException var4) {
- throw new IndexOutOfBoundsException();
- }
- }
-
- public static IntBuffer wrap(int[] var0) {
- return wrap(var0, 0, var0.length);
- }
-
- public abstract IntBuffer slice();
-
- public abstract IntBuffer duplicate();
-
- public abstract IntBuffer asReadOnlyBuffer();
-
- public abstract int get();
-
- public abstract IntBuffer put(int var1);
-
- public abstract int get(int var1);
-
- public abstract IntBuffer put(int var1, int var2);
-
- public IntBuffer get(int[] var1, int var2, int var3) {
- checkBounds(var2, var3, var1.length);
- if (var3 > this.remaining()) {
- throw new BufferUnderflowException();
- } else {
- int var4 = var2 + var3;
-
- for(int var5 = var2; var5 < var4; ++var5) {
- var1[var5] = this.get();
- }
-
- return this;
- }
- }
-
- public IntBuffer get(int[] var1) {
- return this.get(var1, 0, var1.length);
- }
-
- public IntBuffer put(IntBuffer var1) {
- if (var1 == this) {
- throw new IllegalArgumentException();
- } else {
- int var2 = var1.remaining();
- if (var2 > this.remaining()) {
- throw new BufferOverflowException();
- } else {
- for(int var3 = 0; var3 < var2; ++var3) {
- this.put(var1.get());
- }
-
- return this;
- }
- }
- }
-
- public IntBuffer put(int[] var1, int var2, int var3) {
- checkBounds(var2, var3, var1.length);
- if (var3 > this.remaining()) {
- throw new BufferOverflowException();
- } else {
- int var4 = var2 + var3;
-
- for(int var5 = var2; var5 < var4; ++var5) {
- this.put(var1[var5]);
- }
-
- return this;
- }
- }
-
- public final IntBuffer put(int[] var1) {
- return this.put(var1, 0, var1.length);
- }
-
- public final boolean hasArray() {
- return this.field_0 != null && !this.isReadOnly;
- }
-
- public final int[] array() {
- if (this.field_0 == null) {
- throw new UnsupportedOperationException();
- } else if (this.isReadOnly) {
- throw new ReadOnlyBufferException();
- } else {
- return this.field_0;
- }
- }
-
- public final int arrayOffset() {
- if (this.field_0 == null) {
- throw new UnsupportedOperationException();
- } else if (this.isReadOnly) {
- throw new ReadOnlyBufferException();
- } else {
- return this.offset;
- }
- }
-
- public abstract IntBuffer compact();
-
- public abstract boolean isDirect();
-
- public String toString() {
- StringBuffer var1 = new StringBuffer();
- var1.append(this.getClass().getName());
- var1.append("[pos=");
- var1.append(this.position());
- var1.append(" lim=");
- var1.append(this.limit());
- var1.append(" cap=");
- var1.append(this.capacity());
- var1.append("]");
- return var1.toString();
- }
-
- public int hashCode() {
- int var1 = 1;
- int var2 = this.position();
-
- for(int var3 = this.limit() - 1; var3 >= var2; --var3) {
- var1 = 31 * var1 + this.get(var3);
- }
-
- return var1;
- }
-
- public boolean equals(Object var1) {
- if (!(var1 instanceof IntBuffer)) {
- return false;
- } else {
- IntBuffer var2 = (IntBuffer)var1;
- if (this.remaining() != var2.remaining()) {
- return false;
- } else {
- int var3 = this.position();
- int var4 = this.limit() - 1;
-
- for(int var5 = var2.limit() - 1; var4 >= var3; --var5) {
- int var6 = this.get(var4);
- int var7 = var2.get(var5);
- if (var6 != var7 && (var6 == var6 || var7 == var7)) {
- return false;
- }
-
- --var4;
- }
-
- return true;
- }
- }
- }
-
- public int compareTo(IntBuffer var1) {
- int var2 = this.position() + Math.min(this.remaining(), var1.remaining());
- int var3 = this.position();
-
- for(int var4 = var1.position(); var3 < var2; ++var4) {
- int var5 = this.get(var3);
- int var6 = var1.get(var4);
- if (var5 != var6 && (var5 == var5 || var6 == var6)) {
- return var5 < var6 ? -1 : 1;
- }
-
- ++var3;
- }
-
- return this.remaining() - var1.remaining();
- }
-
- public abstract ByteOrder order();
- }
-